On Variable-Sized Bin Packing
نویسنده
چکیده
In variable sized bin packing, a number of bin types are given and the goal is to pack a list of items by choosing appropriate bins such that the total size of bins used is minimized. In this paper, we present absolute worst-case analysis for on-line algorithms. Then we consider an related problem: how to design k different bin sizes such that for any item list the waste space of bins used is minimized. A best possible off-line algorithm is showed for arbitrary k and a best possible on-line algorithm is derived for any fixed number k.
منابع مشابه
A novel greedy quantum inspired cuckoo search algorithm for variable sized bin packing problem
Bin packing is a well-known NP-Hard optimization problem which has several real applications. Classical bin packing (BPP) is a simple model where all bins are identical. However, the variable sized bin packing problem (VSBPP) is a generalization of the bin packing problem where bins of different capacities are available for packing a set of items having different weights. The objective is to pa...
متن کاملOn Variable-Sized Multidimensional Packing
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimensional bins of various sizes, and the goal is to minimize the total volume of the used bins. We show that the method used can also be extended to deal with the problem of resource augmented multidimensional packing, whe...
متن کاملHeuristics for the variable sized bin-packing problem
The Variable Sized Bin Packing Problem has a wide range of application areas including packing, scheduling, and manufacturing. Given a list of items and variable sized bin types, the objective is to minimize the total size of the used bins. This problem is known to be NP-hard. In this article, we present two new heuristics for solving the problem using a new variation of P systems with active m...
متن کاملAn APTAS for Generalized Cost Variable-Sized Bin Packing
Bin packing is a well known problem which has a large number of applications. Classical bin packing is a simple model where all bins are identical. In the bin packing problem with variable sized bins, we are given a supply of a variety of sizes. This latter model assumes, however, that the cost of a bin is always defined to be its exact size. In this paper we study the more general problem wher...
متن کامل